Hamiltonian circuits on simple 3-polytopes with up to 30 vertices
نویسندگان
چکیده
منابع مشابه
Counting d-Polytopes with d+3 Vertices
We completely solve the problem of enumerating combinatorially inequivalent d-dimensional polytopes with d + 3 vertices. A first solution of this problem, by Lloyd, was published in 1970. But the obtained counting formula was not correct, as pointed out in the new edition of Grünbaum’s book. We both correct the mistake of Lloyd and propose a more detailed and self-contained solution, relying on...
متن کاملDistributing vertices on Hamiltonian cycles
Let G be a graph of order n and 3 ≤ t ≤ n4 be an integer. Recently, Kaneko and Yoshimoto provided a sharp δ(G) condition such that for any set X of t vertices, G contains a hamiltonian cycle H so that the distance along H between any two vertices of X is at least n/2t. In this paper, minimum degree and connectivity conditions are determined such that for any graph G of sufficiently large order ...
متن کاملOn light neighborhoods of 5-vertices in 3-polytopes with minimum degree 5
In 1940, in attempts to solve the Four Color Problem, Henry Lebesgue gave an approximate description of the neighborhoods of 5vertices in the class P5 of 3-polytopes with minimum degree 5. Given a 3-polytope P , by w(P ) (h(P )) we denote the minimum degreesum (minimum of the maximum degrees) of the neighborhoods of 5vertices in P . A 5∗-vertex is a 5-vertex adjacent to four 5-vertices. It is k...
متن کاملVertices of Gelfand-Tsetlin Polytopes
This paper is a study of the polyhedral geometry of Gelfand–Tsetlin polytopes arising in the representation theory of glnC and algebraic combinatorics. We present a combinatorial characterization of the vertices and a method to calculate the dimension of the lowest-dimensional face containing a given Gelfand–Tsetlin pattern. As an application, we disprove a conjecture of Berenstein and Kirillov...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of the Mathematical Society of Japan
سال: 1982
ISSN: 0025-5645
DOI: 10.2969/jmsj/03420365